A Formalisation of Lehmer’s Primality Criterion
نویسنده
چکیده
In 1927, Lehmer presented criterions for primality, based on the converse of Fermat’s litte theorem [2]. This work formalizes the second criterion from Lehmer’s paper, a necessary and sufficient condition for primality. As a side product we formalize some properties of Euler’s φ-function, the notion of the order of an element of a group, and the cyclicity of the multiplicative group of a finite field.
منابع مشابه
Note on the Lucas–Lehmer Test
A proof of the Lucas–Lehmer test can be difficult to find, for most textbooks that state the result do not prove it. Over the past two decades, there have been some efforts to produce elementary versions of this famous result. However, the two that we acknowledge in this note did so by using either algebraic numbers or group theory. It also appears that in the process of trying to develop an el...
متن کاملToy Models for D. H. Lehmer’s Conjecture
In 1947, Lehmer conjectured that the Ramanujan τ -function τ(m) never vanishes for all positive integers m, where the τ(m) are the Fourier coefficients of the cusp form ∆24 of weight 12. Lehmer verified the conjecture in 1947 for m < 214928639999. In 1973, Serre verified up to m < 10, and in 1999, Jordan and Kelly for m < 22689242781695999. The theory of spherical t-design, and in particular th...
متن کاملPrimality Proving with Elliptic Curves
Elliptic curves are fascinating mathematical objects. In this paper, we present the way they have been represented inside the COQ system, and how we have proved that the classical composition law on the points is internal and gives them a group structure. We then describe how having elliptic curves inside a prover makes it possible to derive a checker for proving the primality of natural number...
متن کاملPrimality Tests for Numbers of the Form
Let k,m ∈ Z, m ≥ 2, 0 < k < 2 and 2 6| k. In the paper we give a general primality criterion for numbers of the form k·2±1, which can be viewed as a generalization of the LucasLehmer test for Mersenne primes. In particular, for k = 3, 9 we obtain explicit primality tests, which are simpler than current known results. We also give a new primality test for Fermat numbers and criteria for 9 · 2 ± ...
متن کاملOn (Semi-) Edge-primality of Graphs
Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013